The Triangular Theorem of Eight and Representation by Quadratic Polynomials
نویسنده
چکیده
We investigate here the representability of integers as sums of triangular numbers, where the n-th triangular number is given by Tn = n(n + 1)/2. In particular, we show that f(x1, x2, . . . , xk) = b1Tx1 + · · · + bkTxk , for fixed positive integers b1, b2, . . . , bk, represents every nonnegative integer if and only if it represents 1, 2, 4, 5, and 8. Moreover, if ‘cross-terms’ are allowed in f , we show that no finite set of positive integers can play an analogous role, in turn showing that there is no overarching finiteness theorem which generalizes the statement from positive definite quadratic forms to totally positive quadratic polynomials.
منابع مشابه
The Triangular Theorem of Eight and a Certain Non-finiteness Theorem
We investigate here sums of triangular numbers f(x) := ∑ i biTxi where Tn is the n-th triangular number. We show that, fixing bi ≥ 0, f(x) represents every nonnegative integer if and only if it represents 1, 2, 4, 5, and 8, with the standard application to sums of odd squares ∑ i bi(2xi + 1) . Moreover, we show that no finite subset will suffice if “cross terms” are included, in turn showing th...
متن کاملKoszul Algebras Associated to Graphs
Quadratic algebras associated to graphs have been introduced by I. Gelfand, S. Gelfand, and Retakh in connection with decompositions of noncommutative polynomials. Here we show that, for each graph with rare triangular subgraphs, the corresponding quadratic algebra is a Koszul domain with global dimension equal to the number of vertices of the graph.
متن کاملRepresentation of a digitized surface by triangular faces
This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality ...
متن کاملTriangularizing Quadratic Matrix Polynomials
We show that any regular quadratic matrix polynomial can be reduced to an upper triangular quadratic matrix polynomial over the complex numbers preserving the finite and infinite elementary divisors. We characterize the real quadratic matrix polynomials that are triangularizable over the real numbers and show that those that are not triangularizable are quasi-triangularizable with diagonal bloc...
متن کاملRepresentation of a digitized surface by triangular faces
This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013